Brégman’s theorem and extensions
نویسنده
چکیده
Minc conjectured, and Brégman proved, a sharp upper bound on the permanent of an n by n 0-1 matrix with given row sums (equivalently, on the number of perfect matchings in a bipartite graph with each partition class having size n and with fixed degree sequence for one of the two classes). Here we present Radhakrishnan’s entropy proof of Brégman’s theorem, and Alon and Friedland’s proof of an analogous statement for graphs that are not necessarily bipartite. We also discuss progress towards the Upper Matching conjecture of Friedland, Krop and Markström, which extends Brégman’s theorem to arbitrary matchings.
منابع مشابه
Some extensions of Darbo's theorem and solutions of integral equations of Hammerstein type
In this brief note, using the technique of measures of noncompactness, we give some extensions of Darbo fixed point theorem. Also we prove an existence result for a quadratic integral equation of Hammerstein type on an unbounded interval in two variables which includes several classes of nonlinear integral equations of Hammerstein type. Furthermore, an example is presented to show the effic...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملExtensions of Some Fixed Point Theorems for Weak-Contraction Mappings in Partially Ordered Modular Metric Spaces
The purpose of this paper is to establish fixed point results for a single mapping in a partially ordered modular metric space, and to prove a common fixed point theorem for two self-maps satisfying some weak contractive inequalities.
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کامل